Linear and Multilinear Algebra
نویسندگان
چکیده
Taylor & Francis makes every effort to ensure the accuracy of all the information (the “Content”) contained in the publications on our platform. However, Taylor & Francis, our agents, and our licensors make no representations or warranties whatsoever as to the accuracy, completeness, or suitability for any purpose of the Content. Any opinions and views expressed in this publication are the opinions and views of the authors, and are not the views of or endorsed by Taylor & Francis. The accuracy of the Content should not be relied upon and should be independently verified with primary sources of information. Taylor and Francis shall not be liable for any losses, actions, claims, proceedings, demands, costs, expenses, damages, and other liabilities whatsoever or howsoever caused arising directly or indirectly in connection with, in relation to or arising out of the use of the Content.
منابع مشابه
Multilinear forms which are products of linear forms
The conditions under which, multilinear forms (the symmetric case and the non symmetric case),can be written as a product of linear forms, are considered. Also we generalize a result due to S.Kurepa for 2n-functionals in a group G.
متن کاملNumerical multilinear algebra and its applications ∗
Numerical multilinear algebra, in which instead of matrices and vectors the higher-order tensors are considered in numerical viewpoint, is a new branch of computational mathematics. Although it is an extension of numerical linear algebra, it has many essential differences from numerical linear algebra and more difficulties than it. In this paper, we present a survey on the state of the art know...
متن کاملMultilinear Complexity is Equivalent to Optimal Tester Size
In this paper we first show that Tester for an F-algebra A and multilinear forms, [2], is equivalent to multilinear algorithm for the product of elements in A, [3]. Our result is constructive in deterministic polynomial time. We show that given a tester of size ν for an F-algebra A and multilinear forms of degree d one can in deterministic polynomial time construct a multilinear algorithm for t...
متن کاملDendriform Analogues of Lie and Jordan Triple Systems
We use computer algebra to determine all the multilinear polynomial identities of degree ≤ 7 satisfied by the trilinear operations (a · b) · c and a · (b · c) in the free dendriform dialgebra, where a · b is the pre-Lie or the pre-Jordan product. For the pre-Lie triple products, we obtain one identity in degree 3, and three independent identities in degree 5, and we show that every identity in ...
متن کامل